Generic case complexity and One-Way functions
نویسنده
چکیده
Generic case complexity has originated about a decade ago in combinatorial group theory [10, 2]. This area has long computational traditions with many fundamental problems being algorithmic in nature. It has been shown that most computational problems in infinite group theory are recursively undecidable. However, it was also observed that decision algorithms, sometimes very naive ones, exist for many inputs even if a problem is undecidable in general.
منابع مشابه
Future study of Description System Architecture Approaches with Emphasis on Strategic Management
Systems Architecture is a generic discipline to handle objects (existing or to be created) called systems, in a way that supports reasoning about the structural properties of these objects. Systems Architecture is a response to the conceptual and practical difficulties of the description and the design of complex systems. Systems Architecture is a generic discipline to handle objects (existin...
متن کاملUnderstanding Temporal Human Mobility Patterns in a City by Mobile Cellular Data Mining, Case Study: Tehran City
Recent studies have shown that urban complex behaviors like human mobility should be examined by newer and smarter methods. The ubiquitous use of mobile phones and other smart communication devices helps us use a bigger amount of data that can be browsed by the hours of the day, the days of the week, geographic area, meteorological conditions, and so on. In this article, mobile cellular data mi...
متن کاملOn the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sampler that outputs instancesolution pairs such that the distribution on the instances is hard on average, then one-way functions exist. We study the possibility of constructing such a sampler based on the assumption that t...
متن کاملReport on Generic Case Complexity
This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of a computational problem while ignoring atypical behavior on a small set of inputs. Generic case complexity applies to both recursively solvable and recursively unsolvable problems.
متن کاملMusings on generic-case complexity
We propose a more general definition of generic-case complexity, based on using a random process for generating inputs of an algorithm and using the time needed to generate an input as a way of measuring the size of that input.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Groups Complexity Cryptology
دوره 1 شماره
صفحات -
تاریخ انتشار 2009